| AbstractGraph<V,E> |
Abstract implementation of the Graph interface.
|
| AbstractTypedGraph<V,E> |
An abstract class for graphs whose edges all have the same EdgeType.
|
| BetweennessCentrality<V,E> |
Computes betweenness centrality for each vertex and edge in the graph.
|
| CommonMatcher |
The subset of the Matcher API which is used by this
package, and also shared with the re2j library.
|
| CommonPattern |
The subset of the Pattern API which is used by this
package, and also shared with the re2j library.
|
| EdgeBetweennessClusterer<V,E> |
An algorithm for computing clusters (community structure) in graphs based on
edge betweenness.
|
| Functions |
|
| Functions.ConstantFunction<E> |
|
| Functions.ForMapWithDefault<K,V> |
|
| Functions.FunctionComposition<A,B,C> |
|
| Functions.FunctionForMapNoDefault<K,V> |
|
| Functions.PredicateFunction<T> |
|
| Functions.SupplierFunction<T> |
|
| JdkPattern |
|
| JdkPattern.JdkMatcher |
|
| MapBinaryHeap<T> |
|
| Pair<T> |
An implementation of Collection that stores exactly 2 non-null
objects and is not mutable.
|
| Preconditions |
|
| Predicates |
|
| Predicates.AndPredicate<T> |
|
| Predicates.CompositionPredicate<A,B> |
|
| Predicates.ContainsPatternPredicate |
|
| Predicates.InPredicate<T> |
|
| Predicates.InstanceOfPredicate |
|
| Predicates.IsEqualToPredicate<T> |
|
| Predicates.NotPredicate<T> |
|
| Predicates.OrPredicate<T> |
|
| Predicates.SubtypeOfPredicate |
|
| SparseGraph<V,E> |
An implementation of Graph that is suitable for sparse graphs
and permits both directed and undirected edges.
|
| UndirectedSparseGraph<V,E> |
An implementation of UndirectedGraph that is suitable for sparse
graphs.
|
| WeakComponentClusterer<V,E> |
Finds all weak components in a graph as sets of vertex sets.
|